Tight Bounds for Complementing Parity Automata
نویسندگان
چکیده
We follow a connection between tight determinisation and complementation and establish a complementation procedure from transition-labelled parity automata to transition-labelled nondeterministic Büchi automata. We prove it to be tight up to an O(n) factor, where n is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities.
منابع مشابه
A Tight Lower Bound for the Complementation of Rabin Automata
Complementing ω-automata is a crucial instrument for solving the ω-language containment problem, and therefore it has numerous applications in formal language theory, program analysis and modelchecking. There have been great interests in determining the exact complexity of the complementation problem. However, obtaining nontrivial lower bounds for the complementation problem has been difficult....
متن کاملTight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problemin automata theory, but also serves as a cornerstone for solving numerous decision problemsin mathematical logic, model-checking, program analysis and verification. For Streett comple-mentation, a significant gap exists between the current lower bound 2 lgnk) and upper bound2 lg , where n i...
متن کاملDeterminising Parity Automata
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a sm...
متن کاملTight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
This paper studies lower bounds for arithmetic circuits computing (non-commutative) polynomials. Our conceptual contribution is an exact correspondence between circuits and weighted automata: algebraic branching programs are captured by weighted automata over words, and circuits with unique parse trees by weighted automata over trees. The key notion for understanding the minimisation question o...
متن کاملDeterminization of $\omega$-automata unified
We present a uniform construction for converting ω-automata with arbitrary acceptance conditions to equivalent deterministic parity automata (DPW). Given a non-deterministic automaton with n states, our construction gives a DPW with at most 2 2 logn) states and O(n) parity indices. The corresponding bounds when the original automaton is deterministic are O(n!) and O(n), respectively. Our algori...
متن کامل